- bounded edge
- край с окантовкой
English-Russian dictionary of leather and footwear industry. проф., д-р техн. наук Г. Арбузов, к.т.н. А. Михайлова, И. Качко, к-т. фил.н. Я. Смирницкая.
bounded edge
Смотреть что такое "bounded edge" в других словарях:
Edge End, Gloucestershire — Edge End is a small hamlet in west Gloucestershire, England.Location AmenitiesEdge End is about 1.5 miles NW of Coleford and about 1 mile north of the Royal Forest of Dean College. Originally close to some mine workings, all of which have now… … Wikipedia
Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… … Wikipedia
Geology of Alderley Edge — Infobox Mountain Name = Alderley Edge Photo = Stormy Point 1993.jpg Caption = Stormy Point Elevation = 183 m (600 ft) Location = Cheshire, ENG Range = Prominence = Coordinates = Topographic OS Landranger 118 Grid ref UK = SJ870760 Grid ref… … Wikipedia
On the Edge (book) — For other uses, see On the Edge (disambiguation). On the Edge … Wikipedia
Shape of the Universe — Edge of the Universe redirects here. For the Bee Gees song, see Edge of the Universe (song). The local geometry of the universe is determined by whether Omega is less than, equal to or greater than 1. From top to bottom: a spherical universe, a… … Wikipedia
Polyhedron — Polyhedra redirects here. For the relational database system, see Polyhedra DBMS. For the game magazine, see Polyhedron (magazine). For the scientific journal, see Polyhedron (journal). Some Polyhedra Dodecahedron (Regular polyhedron) … Wikipedia
Decomposition method (constraint satisfaction) — In constraint satisfaction, a decomposition method translates a constraint satisfaction problem into another constraint satisfaction problem that is binary and acyclic. Decomposition methods work by grouping variables into sets, and solving a… … Wikipedia
Minor (graph theory) — In graph theory, an undirected graph H is called a minor of the graph G if H is isomorphic to a graph that can be obtained by zero or more edge contractions on a subgraph of G. The theory of graph minors began with Wagner s theorem that a graph… … Wikipedia
Tree decomposition — A graph with eight vertices, and a tree decomposition of it onto a tree with six nodes. Each graph edge connects two vertices that are listed together at some tree node, and each graph vertex is listed at the nodes of a contiguous subtree of the… … Wikipedia
National Register of Historic Places listings in Fairfield County, Connecticut — Location of Fairfield County in Connecticut This is intended to be a complete list of the properties and districts on the National Register of Historic Places in Fairfield County, Connecticut, United States. The locations of National Register… … Wikipedia
Planar graph — Example graphs Planar Nonplanar Butterfly graph K5 The complete graph K4 … Wikipedia
